Modified relay selection and circuit selection for faster Tor
نویسندگان
چکیده
منابع مشابه
Modified Relay Selection and Circuit Selection for Faster Tor
Users of the Tor anonymity system suffer from less-than-ideal performance, in part because circuit building and selection processes are not tuned for speed. In this paper, we examine both the process of selecting among pre-built circuits and the process of selecting the path of relays for use in building new circuits to improve performance while maintaining anonymity. First, we show that having...
متن کاملAn Empirical Evaluation of Relay Selection in Tor
While Tor is the most popular low-latency anonymity network in use today, Tor suffers from a variety of performance problems that continue to inhibit its wide scale adoption. One reason why Tor is slow is due to the manner in which clients select Tor relays. There have been a number of recent proposals for modifying Tor’s relay selection algorithm, often to achieve improved bandwidth, latency, ...
متن کاملThe Evaluation of Circuit Selection Methods on Tor
Tor provides anonymity online by routing traffic through encrypted tunnels, called circuits, over paths of anonymizing relays. To enable users to connect to their selected destination servers without waiting for the circuit to be build, the Tor client maintains a few circuits at all times. Nevertheless, Tor is slower to use than directly connecting to the destination server. In this paper, we p...
متن کاملCongestion-Aware Path Selection for Tor
Tor, an anonymity network formed by volunteer nodes, uses the estimated bandwidth of the nodes as a central feature of its path selection algorithm. The current load on nodes is not considered in this algorithm, however, and we observe that some nodes persist in being under-utilized or congested. This can degrade the network’s performance, discourage Tor adoption, and consequently reduce the si...
متن کاملFaster Subset Selection for Matrices and Applications
We study the following problem of subset selection for matrices: given a matrix X ∈ Rn×m (m > n) and a sampling parameter k (n ≤ k ≤ m), select a subset of k columns from X such that the pseudoinverse of the sampled matrix has as small a norm as possible. In this work, we focus on the Frobenius and the spectral matrix norms. We describe several novel (deterministic and randomized) approximation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IET Communications
سال: 2019
ISSN: 1751-8628,1751-8636
DOI: 10.1049/iet-com.2018.5591